On First Order Logic of Proofs
نویسنده
چکیده
The Logic of Proofs LP solved long standing Gödel’s problem concerning his provability calculus (cf. [4]). It also opened new lines of research in proof theory, modal logic, typed programming languages, knowledge representation, etc. The propositional logic of proofs is decidable and admits a complete axiomatization. In this paper we show that the first order logic of proofs is not recursively axiomatizable. 2000 Math. Subj. Class. 03F45 (primary), 03F30, 03F50.
منابع مشابه
On the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملDifferent Proofs are Good Proofs
In order to compare the quality of proofs, it is necessary to measure artifacts of the proofs, and evaluate the measurements to determine differences between the proofs. This paper discounts the approach of ranking proofs by their measured proof artifacts, and takes the position that different proofs are good proofs. The position is based on proofs in the TSTP solution library, which are genera...
متن کاملNotes on Logic
1. Syntax 1 2. Semantics 4 3. Boolean algebra 7 4. Classification 12 5. Quantum logic 15 6. Formal proofs 17 7. First-order languages and syntax 22 8. First-order semantics 25 9. Examples of first-order languages 28 10. Completeness and compactness 29 11. Consequences of compactness 31 12. Downwards Löwenheim-Skolem 34 13. Filters and ultrafilters 37 14. Voting 41 15. Ultraproducts 45 16. Forma...
متن کاملTranslation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
I present a way of generating proofs from resolution proofs containing Skolemization. The resulting proofs are purely first-order, i.e. do not make use of ’choice axioms’, ’satisfiability preserving proof steps’, etc. The resulting firts-order proofs are short, i.e. polynomial in the output of the theorem prover.
متن کاملAn analysis of the constructive content of Henkin’s proof of Gödel’s completeness theorem DRAFT
Gödel’s completeness theorem for first-order logic is one of the best-known theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula. There are various views on the completeness theorem, various presentations, various formalisations, various proofs of it. We survey the most standard different approaches and eventua...
متن کامل